Two Algorithms For Static Polygon Shape Formation Control

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Shape Control for Adaptive Wings

A theoretical method was developed, and experimentally validated, to control the static shape of flexible structures by employing internal translational actuators. A finite element model of the structure, without the actuators present, is employed to obtain the multiple-input, multiple-output control-system gain matrices for actuator-load control as well as actuator-displacement control. The me...

متن کامل

Approximation algorithms for the two-center problem of convex polygon

Given a convex polygon P with n vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover P . We propose an algorithm for this problem in the streaming setup, where the input stream is the vertices of the polygon in clockwise order. It produces a radius r satisfying r ≤ 2ropt using O(1) space, where ropt is the optimum solution. Nex...

متن کامل

Investigation of Two Vector Control Based Methods for Static Synchronous Series Compensator

In this paper, two vector control systems for investigating the performance of Static Synchronous Series Compensators (SSSC) in steady state conditions are presented that are based on famous d-q axis theory. The workability of proposed method to simplify the SSSC mathematical expressions is shown. The performance of SSSC with two different vector controllers, first based on d-q line current...

متن کامل

Efficient Polygon Approximations for Shape Signatures

This paper presents a novel algorithm for polygon approximation which is eecient in the sense of rate-distortion quality and computation time. Special attention is hereby given to generate polygons with a low number of nodes, which are suitable as shape signatures in image retrieval from multimedia databases.

متن کامل

Optimal Parallel Hypercube Algorithms for Polygon Problems

We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(logn)-lime, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-verlex simple polygon P for monotonicity, and other related...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iraqi Journal for Electrical and Electronic Engineering

سال: 2020

ISSN: 2078-6069,1814-5892

DOI: 10.37917/ijeee.sceeer.3rd.8